A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
نویسنده
چکیده
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of Higman, and on the Rabin tree theorem. In this way, we get purely logical, short proofs for some known facts on decidability, which might be of methodological interest. Our approach is also applicable to some other similar situations, say to ”words” over dense orderings which is relevant to the continuous time
منابع مشابه
On Decidability of Hierarchies of Regular Aperiodic Languages
In automata theory, several natural hierarchies of regular languages are studied. Among the most popular are hierarchies of Brzozowski and Straubing (see e.g [11]), both exhausting the class of so called regular aperiodic (or star–free) languages. A natural question about these hierarchies is formulated as follows: given a level of a hierarchy and a finite automaton, one has to decide effective...
متن کاملBoundedness in languages of infinite words
We define a new class of languages of ω-words, strictly extending ω-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of ω-regular expressions where two new variants of the Kleene star L are added: L and L . These new exponents are used to say that parts of the input word have bounded size, and that parts of the input ...
متن کاملDecidability of Context Logic
We consider the problem of decidability for Context Logic for sequences, ranked trees and unranked trees. We show how to translate quantifier-free formulae into finite automata that accept just the sequences or trees which satisfy the formulae. Satisfiability is thereby reduced to the language emptiness problem for finite automata, which is simply a question of reachability. This reduction show...
متن کاملA counterexample to a conjecture concerning concatenation hierarchies
We give a counterexample to the conjecture which was originally formulated by Straubing in 1986 concerning a certain algebraic characterization of regular languages of level 2 in the Straubing-Thérien concatenation hierarchy of star-free languages.
متن کاملA survey on difference hierarchies of regular languages
Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages. The first sections describe standard techniques on difference hierarchies, mostly due to Hausdorff. We illustrate these techniques by giving decidability results on the difference hierarchies based o...
متن کامل